Equivalence Test and Ordering Transformation for Parity-OBDDs of Different Variable Ordering
نویسندگان
چکیده
Ordered binary decision diagrams (OBDDs) have already proved useful for example in the veriication of combinational and sequential circuits. But the applications are limited, since the decriptive power of OBDDs is limited. Therefore several more general BDD models are studied. In this paper the so{called Parity{OBDDs are considered. The two polynomial time algorithms given are motivated by the fact that Parity{OBDD representation size essentially depends on the variable ordering. The one decides the equivalence of two Parity{OBDDs of possibly distinct variable ordering. The other one transforms a Parity{OBDD with respect to one variable ordering into an equivalent Parity{OBDD with respect to another preassigned variable ordering.
منابع مشابه
On Random Orderings of Variables for Parity OBDDs
Ordered binary decision diagrams (OBDDs) are a model for representing Boolean functions. There is also a more powerful variant called parity OBDDs. The size of the representation of a given function depends in both these models on an ordering of the variables. It is known that there are functions such that almost all orderings of its variables yield an OBDD of polynomial size, but there are als...
متن کاملDesign and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Distributed Hybrid Genetic Programming for Learning Boolean Functions
When genetic programming (GP) is used to find programs with Boolean inputs and outputs, ordered binary decision diagrams (OBDDs) are often used successfully. In all known OBDD-based GP-systems the variable ordering, a crucial factor for the size of OBDDs, is preset to an optimal ordering of the known test function. Certainly this cannot be done in practical applications, where the function to l...
متن کاملDistributed Hybrid Genetic Programming for Learning Boolean Functions
When genetic programming (GP) is used to find programs with Boolean inputs and outputs, ordered binary decision diagrams (OBDDs) are often used successfully. In all known OBDD-based GP-systems the variable ordering, a crucial factor for the size of OBDDs, is preset to an optimal ordering of the known test function. Certainly this cannot be done in practical applications, where the function to l...
متن کاملGlobal rebuilding of OBDDs Avoiding Memory Requirement Maxima
It is well-known that the size of an ordered binary decision diagram (OBDD) may depend crucially on the order in which the variables occur. In the paper, we describe an implementation of an output{ eecient algorithm that transforms an OBDD P representing a Boolean function f with respect to one variable ordering into an OBDD Q that represents f with respect to another variable ordering. The alg...
متن کاملLearning Ordered Binary Decision Diagrams
This note studies the learnability of ordered binary decision diagrams (obdds). We give a polynomial-time algorithm using membership and equivalence queries that nds the minimum obdd for the target respecting a given ordering. We also prove that both types of queries and the restriction to a given ordering are necessary if we want minimality in the output, unless P=NP. If learning has to occur ...
متن کامل